Diffie-Hellman technique: extended to multiple two-party keys and one multi-party key

نویسنده

  • Gautam Biswas
چکیده

Diffie –Hellman technique: extended to multiple two-party keys and one multi-party key Abstract: The two-party Diffie– Hellman (DH) key-exchanging technique is extended to generate (i) multiple two-party keys and (ii) one multi-party key. The participants in the former case exchange two public keys and generate 15 shared keys. Of these, 4 keys are called base keys, because they are used to generate the other 11 keys called extended keys. The main advantages are the reduction of the key exchange overhead, increase of additional protection to the keys and widening of applicability. In the latter case, an efficient contributory multi-party key-exchanging technique for a large static group is proposed. In this technique, a member who acts as a group controller forms two-party groups with other group members and generates a DH-style shared key per group. It then combines these keys into a single multi-party key and acts as a normal group member. The proposed technique has been compared with other multi-party key-generating techniques, and satisfactory results have been obtained.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extended Diffie-Hellman Technique to Generate Multiple Shared Keys at a Time with Reduced KEOs and its Polynomial Time Complexity

Recently Biswas[1] extended Diffie-Hellman technique to generate multiple two-person-shared keys by exchange of two public keys. In this paper, we further generalize the Diffie-Hellman technique to generate multiple two-person-shared keys by exchange of any number of public keys and study its Polynomial Time Complexity, Security etc. Also, an upper bound for the number of shared keys in terms o...

متن کامل

The n-Diffie-Hellman Problem and Its Applications

The main contributions of this paper are twofold. On the one hand, the twin Diffie-Hellman (twin DH) problem proposed by Cash, Kiltz and Shoup is extended to the n-Diffie-Hellman (n-DH) problem for an arbitrary integer n, and this new problem is shown to be at least as hard as the ordinary DH problem. Like the twin DH problem, the n-DH problem remains hard even in the presence of a decision ora...

متن کامل

On reusing ephemeral keys in Diffie-Hellman key agreement protocols

A party may choose to reuse ephemeral public keys in a Diffie-Hellman key agreement protocol in order to reduce its computational workload or to mitigate against denial-of-service attacks. In this note we highlight the danger of reusing ephemeral keys if domain parameters are not appropriately selected or if public keys are not appropriately validated.

متن کامل

CJ 04 - 092 . R 2 A robust multi - party key agreement protocol resistant to malicious participants †

By its very nature, a non-authenticated multi-party key agreement protocol cannot provide participant and message authentication, so it must rely on an authenticated network channel. This paper presents the inability of two famous multi-party key agreement protocols to withstand malicious participant attacks, even though their protocols are based on the authenticated network channel. This attac...

متن کامل

Cryptanalysis of Tseng-Wu Group Key Exchange Protocol

Recently, Tseng and Wu pointed out that the second protocol of Biswas’s two-party keys scheme based on the Diffie-Hellman technique has a security weakness and proposed a new protocol to remedy the weakness. In this article, we point out that Tseng-Wu’s protocol is vulnerable to a man-in-the-middle attack. An attacker could intercept, delete, or modify the communicated messages between two comm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IET Information Security

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2008